From Explicit to Implicit Dynamic Frames in Concurrent Reasoning for Java

In [9] we presented an approach to permission-based reasoning about concurrent Java programs in the context of the interactive program verifier KeY [1] which is based on Dynamic Logic and explicit dynamic frames [6, 13]. We argued for the explicit approach advocating the modular use (w.r.t. sequential vs. concurrent) and overall preciseness. It was noted, however, that changing our specification and verification approach to an established one of implicit dynamic frames (IDF) [11] should be also possible. In consequence, this would allow us to translate Separation Logic (SL) specifications [12, 2] into our framework to provide a powerful interactive theorem prover support for SL-like formalisms. In this context, we present some of the challenges associated with transition to implicit frames in KeY and possible solutions.